Real-time scheduling to minimize machine busy times
نویسندگان
چکیده
منابع مشابه
Real-time scheduling to minimize machine busy times
We consider power-aware scheduling problems where the power consumption of a machine is assumed to be proportional to the time it is in on state, also called its busy-time. In our model, the jobs have release times, deadlines and processing times. Assuming that each machine can process multiple jobs simultaneously, the goal is to schedule all jobs non-preemptively in their release-time-deadline...
متن کاملMinimizing Busy Time in Multiple Machine Real-time Scheduling
We consider the following fundamental scheduling problem. The input consists of n jobs to be sched-uled on a set of machines of bounded capacities. Each job is associated with a release time, a duedate, a processing time and demand for machine capacity. The goal is to schedule all of the jobsnon-preemptively in their release-time-deadline windows, subject to machine capacity con...
متن کاملNon-Clairvoyant Scheduling to Minimize Max Flow Time on a Machine with Setup Times
Consider a problem in which n jobs that are classified into k types arrive over time at their release times and are to be scheduled on a single machine so as to minimize the maximum flow time. The machine requires a setup taking s time units whenever it switches from processing jobs of one type to jobs of a different type. We consider the problem as an online problem where each job is only know...
متن کاملSingle machine scheduling problem with interval processing times to minimize mean weighted completion time
The single resource scheduling problem is commonly applicable in practice not only when there is a single resource but also in some multiple-resource production systems where only one of the resources is bottle neck. Thus, the single resource (machine) scheduling problem has been widely addressed in the scheduling literature. In this paper, the single machine scheduling problem with uncertain a...
متن کاملThree-Machine Flowshop Scheduling Problem to Minimize Total Completion Time with Bounded Setup and Processing Times
The three-machine flowshop scheduling problem to minimize total completion time is studied where setup times are treated as separate from processing times. Setup and processing times of all jobs on all machines are unknown variables before the actual occurrence of these times. The lower and upper bounds for setup and processing times of each job on each machine is the only information that is a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Scheduling
سال: 2014
ISSN: 1094-6136,1099-1425
DOI: 10.1007/s10951-014-0411-z